Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
نویسندگان
چکیده
منابع مشابه
Graphs with Forbidden Subgraphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. For example, a tree can be defined as a connected graph which contains no cycles, and Kuratowski [22] characterized plan...
متن کاملEfficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
Alon et. al. [3], showed that every property that is characterized by a finite collection of forbidden induced subgraphs is -testable. However, the complexity of the test is double-tower with respect to 1/ , as the only tool known to construct such tests uses a variant of Szemerédi’s Regularity Lemma. Here we show that any property of bipartite graphs that is characterized by a finite collectio...
متن کاملColoring Graphs with Forbidden Induced Subgraphs
Efficiently coloring an arbitrary graph is a fundamental and notoriously difficult algorithmic problem. This talk focuses on the restricted problem of determining the complexity of coloring graphs which do not contain a certain induced subgraph. Combining results of Kamiński and Lozin, and Hoyler, it follows that this problem remains NP-complete unless the excluded induced subgraph is a disjoin...
متن کاملUniversal Graphs (with Forbidden Subgraphs)
The graph theoretic problem of identifying the finite sets C of constraint graphs for which there is a countable universal C-free graph is closely related to the problem of determining for which sets C the model companion T ∗ C of the theory of C-free graphs is א0-categorical, and this leads back to combinatorics. Little is known about these theories from any other perspective, such as stabilit...
متن کاملUnavoidable induced subgraphs in large graphs with no homogeneous sets
An n-vertex graph is prime if it has no homogeneous set, that is a set X of vertices (2 ≤ |X| ≤ n − 1) such that every vertex not in X is either complete or anticomplete to X. A chain of length t is a sequence of t+ 1 vertices such that for every vertex in the sequence except the first one, its immediate predecessor is its unique neighbor or its unique non-neighbor among all of its predecessors...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2020
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22639